Svm Support in the Vienna Fortran Compilation System

نویسندگان

  • Peter Brezany
  • Michael Gerndt
چکیده

Vienna Fortran, a machine-independent language extension to Fortran which allows the user to write programs for distributed-memory systems using global addresses, provides the forall loop construct for specifying irregular computations that do not cause inter-iteration dependences. Compilers for distributed-memory systems cannot generate eecient code for such loops using compile-time techniques only. This paper presents the runtime message passing implementation and the SVM implementation. We compare both approaches and present rst performance results for a realistic loop.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SVM Support in the Vienna Fortran Compiling System

Vienna Fortran, a machine-independent language extension to Fortran which allows the user to write programs for distributed-memory systems using global addresses, provides the forall-loop construct for specifying irregular computations that do not cause inter-iteration dependences. Compilers for distributed-memory systems generate code that is based on run-time analysis techniques and is only e...

متن کامل

Coupling Parallel Data and Work Partitioners to VFCS

A signiicant amount of software research for developing programming environments for distributed{memory systems (DMSs) is currently underway in both aca-demia as well as industry. This paper addresses the automatic parallelization of irregular codes for DMSs. We present the language constructs provided by Vienna Fortran to deal eeciently with irregular codes. They have been implemented within t...

متن کامل

Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation

Vienna Fortran, High Performance Fortran (HPF), and other data parallel languages have been introduced to allow the programming of massively parallel distributed-memory machines (DMMP) at a relatively high level of abstraction, based on the SPMD paradigm. Their main features include directives to express the distribution of data and computations across the processors of a machine. In this paper...

متن کامل

Performance Range Comparison for Restructuring Compilation Xian-he Sun

A major diiculty in restructuring compilation is how to compare parallel performance over a range of system and problem sizes. This study introduces the concept of range comparison for data-parallel programming. Unlike conventional execution time comparison in which performance is compared for a particular system and problem size, range comparison compares the performance of programs over a ran...

متن کامل

Performance Range

A major diiculty in restructuring compilation is how to compare parallel performance over a range of system and problem sizes. This study introduces the concept of range comparison for data-parallel programming. Unlike conventional execution time comparison in which performance is compared for a particular system and problem size, range comparison compares the performance of programs over a ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008